Combinatorial optimization

Results: 1158



#Item
931Numerical analysis / Combinatorial optimization / Cutting-plane method / Linear programming / COIN-OR / Linear programming relaxation / SCIP / Cut / Generator / Mathematical optimization / Operations research / Mathematics

On the safety of Gomory cut generators ´rard Cornue ´jols1 , Franc Ge ¸ ois Margot1 , Giacomo Nannicini2 1

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2013-02-05 11:26:22
932Artificial intelligence / Search algorithms / Routing algorithms / Combinatorial optimization / Network theory / A* search algorithm / Pathfinding / Fringe search / Decomposition method / Mathematics / Game artificial intelligence / Graph theory

Breaking Path Symmetries on 4-connected Grid Maps Daniel Harabor and Adi Botea NICTA and The Australian National University Email: [removed] Abstract

Add to Reading List

Source URL: harablog.files.wordpress.com

Language: English - Date: 2010-10-20 21:58:33
933Combinatorial optimization / Cutting-plane method / Branch and bound / Branching / Linear programming relaxation / Branch point / Linear programming / Exponentiation / Heuristic function / Mathematical optimization / Mathematical analysis / Mathematics

Mathematical Programming manuscript No. (will be inserted by the editor) Branching on General Disjunctions Miroslav Karamanov · G´erard Cornu´ejols

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2009-08-09 22:53:56
934Combinatorial optimization / Algebraic combinatorics / Representation theory / Glycoproteins / Immune system / Immunoglobulin D / Restricted representation / Linear programming relaxation / Branch and bound / Mathematics / Mathematical optimization / Theoretical computer science

Mathematical Programming manuscript No. (will be inserted by the editor) Improved strategies for branching on general disjunctions G. Cornu´ejols · L. Liberti · G. Nannicini

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2008-07-21 10:04:56
935Line graph / Clique / Perfect graph / Bipartite graph / Matching / NP-complete problems / Combinatorial optimization / Tree decomposition / Graph structure theorem / Graph theory / Graph operations / Chordal graph

Perfect Graphs, Partitionable Graphs and Cutsets Michele Conforti  Gerard Cornuejols y Grigor Gasparyan z and Kristina Vuskovic x

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2000-09-19 18:20:11
936Graph coloring / Planar graphs / Edge coloring / Sperner family / Matroid / Bipartite graph / Petersen graph / Cubic graph / Minor / Graph theory / Mathematics / Matroid theory

Combinatorial Optimization: Packing and Covering G´erard Cornu´ejols Carnegie Mellon University July 2000

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2005-08-27 11:07:38
937Combinatorial optimization / Operations research / Relaxation / Convex optimization / Linear programming relaxation / Linear programming / Cutting-plane method / Graph / Matching / Mathematical optimization / Mathematics / Graph theory

How tight is the corner relaxation? Insights gained from the stable set problem G´erard Cornu´ejolsa,1 , Carla Michinib,2,∗, Giacomo Nannicinic,3 a Tepper School of Business, Carnegie Mellon University, Pittsburgh,

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2012-02-13 11:38:14
938Operations research / Convex optimization / Linear programming / Combinatorial optimization / Relaxation / Approximation algorithm / Cutting-plane method / Optimization problem / Nonlinear programming / Mathematical optimization / Mathematics / Applied mathematics

An algorithmic framework for convex mixed integer nonlinear programs Pierre Bonami1,5 , Lorenz T. Biegler2 , Andrew R. Conn3 , G´erard Cornu´ejols1,4 , Ignacio E. Grossmann2 , Carl D. Laird2,5 , Jon Lee3 , Andrea Lodi3

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2006-04-16 15:22:42
939Linear programming relaxation / Relaxation / Valuation / Mathematics / Combinatorial optimization / Linear programming

Branching on Split Disjunctions G. NANNICINI a,1 , G. CORNUÉJOLS a,2 , M. KARAMANOV b , L. LIBERTI c,3 a Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA b Capacity and Operations Planning, Bank of

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2010-08-23 17:53:30
940Combinatorial optimization / Linear programming / Convex optimization / Cutting-plane method / Rank / Linear programming relaxation / Mathematical optimization / Mathematics / Operations research

Noname manuscript No. (will be inserted by the editor) Practical strategies for generating rank-1 split cuts in mixed-integer linear programming Gerard Cornu´

Add to Reading List

Source URL: integer.tepper.cmu.edu

Language: English - Date: 2011-07-14 10:16:42
UPDATE